Systems and methods for signing of a message

ABSTRACT

There is provided a requestor device for digital signing of a message, comprising: at least one hardware processor executing a code for: transmitting the message for signing thereof, in a single request session over the network to each one of a plurality of validator devices, wherein a beacon device computes and transmits over a network to each one of a plurality of validator devices a signature-data value computed and signed by the beacon device, receiving in a single response session from each one of the plurality of validator devices, a respective partial-open decrypted value computed for the signature-data value and the message, and aggregating the partial-opens decrypted values received from the plurality of validator devices to compute the digital signature of the message.

RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.17/396,831 filed on Aug. 9, 2021, which is a continuation of U.S. patentapplication Ser. No. 16/559,693 filed on Sep. 4, 2019, now U.S. Pat. No.11,088,851. The contents of the above application are all incorporatedby reference as if fully set forth herein in their entirety.

FIELD AND BACKGROUND OF THE INVENTION

The present invention, in some embodiments thereof, relates to networksecurity and, more specifically, but not exclusively, to systems andmethods for digital signing of a message transmitted over a network.

Messages sent over an insecure channel, such as a publicly accessiblenetwork, require a mechanism to enable the receiver to trust that theoriginator actually sent the message. Cryptographic methods are used todigitally sign the message.

Digital signing of messages is used, for example, in blockchainenvironments, to verify the authenticity of a transaction, for example,transfer of cryptocurrencies from one digital wallet to another digitalwallet.

SUMMARY OF THE INVENTION

According to a first aspect, a requestor device for digital signing of amessage, comprises: at least one hardware processor executing a codefor: transmitting the message for signing thereof, in a single requestsession over the network to each one of a plurality of validatordevices, wherein a beacon device computes and transmits over a networkto each one of a plurality of validator devices a signature-data valuecomputed and signed by the beacon device, receiving in a single responsesession from each one of the plurality of validator devices, arespective partial-open decrypted value computed for the signature-datavalue and the message, and aggregating the partial-opens decryptedvalues received from the plurality of validator devices to compute thedigital signature of the message.

According to a second aspect, a system for digital signing of a message,comprises: a plurality of validator devices, each including at least onehardware processor executing a code for: receiving from a beacon deviceover a network a signature-data value computed and signed by the beacondevice, receiving the message for signing thereof from a requestordevice over the network in a single request session, computing arespective partial-open decrypted value of the signature-data value andthe message, and transmitting the respective partial-open decryptedvalue to the requestor device in a single response session, wherein therequestor device aggregates the partial-open decrypted values receivedfrom the plurality of validator devices to compute the digital signatureof the message.

According to a third aspect, a system for digital signing of a message,comprises: (A) at least one hardware processor of a beacon deviceexecuting a code for: computing and transmitting over a network to eachone of a plurality of validator devices: a signature-data value computedand signed by the beacon device, (B) a plurality of validator devices,each including at least one hardware processor executing a code for:receiving the message for signing thereof from a requestor device overthe network in a single request session, computing a respectivepartial-open decrypted value for the signature-data value and themessage, and transmitting the respective partial-open decrypted value tothe requestor device in a single response session, wherein the requestordevice aggregates the partial-open decrypted values to compute thedigital signature of the message.

In a further implementation of the first, second, and third aspects,further comprising code for identifying which of the plurality ofvalidator devices is malicious when the digital signature is notvalidated, by comparing, for each respective validator device of theplurality of validator device, a first value computed using uniquevalues for the respective validator device provided by the beacon deviceand using the message, with a second value computed using an indicationof proof provided by the respective validator device based on the uniquevalues and the message.

In a further implementation of the first, second, and third aspects,further comprising code for validating that the digital signaturecomputed by aggregating the partial-open decrypted values received fromthe plurality of validator devices is a valid signature of the message.

In a further implementation of the first, second, and third aspects,further comprising code for computing an unencrypted signature of themessage from the partial open decrypted values.

In a further implementation of the first, second, and third aspects, therequestor device is one of the plurality of validator devices.

In a further implementation of the first, second, and third aspects,further comprising code for checking whether the message qualifies forsigning by each respective validator device of the plurality ofvalidator devices according to a respective set-of-rules.

In a further implementation of the first, second, and third aspects,further comprising code for validating that the beacon device signed thesignature-data value and that the signature-data value has not beenpreviously used.

In a further implementation of the first, second, and third aspects,further comprising code for computing and transmitting over the networkto each one of the plurality of validator devices, a public key, and arespective split-private key of a plurality of split-private keys,wherein the signature-data value includes a DSA-private key computed bythe beacon device using a digital signature algorithm (DSA) process,wherein the DSA-private key is at least one of: encrypted with thepublic key corresponding to the private key that is split into theplurality of split-private keys computed based on an encryption processthat is additive homomorphic and includes a threshold decryptionprocess, and each one of the plurality of validator devices furtherincludes code for computing the respective partial-open decrypted valueusing the respective split-private key applied to the signature-datavalue and the message.

In a further implementation of the first, second, and third aspects, asignature-data value and a private key are split and shared with eachone of the plurality of validator devices using a secret sharing processsatisfying the property of level-1 homomorphic sum secret sharing byenabling a multiplication operation of encrypted values.

In a further implementation of the first, second, and third aspects, thesignature-data value that is split and shared is selected from aplurality of signature-data values and the private key that is split andshared is selected from a plurality of private keys used to compute therespective partial-open decrypted values, without the plurality ofvalidator devices knowing the certain signature data value and thecertain private key that is selected.

In a further implementation of the first, second, and third aspects, thesignature-data value is shared with each one of the plurality ofvalidator devices using a secret sharing process that is homomorphic toaddition, and each one of the plurality of validator devices furtherincludes code for computing the respective partial-open decrypted valuebased on the secret sharing process.

In a further implementation of the first, second, and third aspects, anumber of the plurality of split-private keys corresponds to a number ofvalidator devices, and the digital signature of the message is computedonly when all of the number of the plurality of validator devicesprovide respective partial-open decrypted values.

In a further implementation of the first, second, and third aspects,further comprising defining a minimum security level of a number ofvalidator device out of a total number of validator devices required toprovide respective partial-open decrypted values for computing of thedigital signature of the message, increasing the minimum security levelto a minimum threshold according to a set of rules, wherein a number ofthe plurality of split-private keys corresponds to the total number ofvalidator devices, and the digital signature of the message is computedwhen the number of the plurality of validator devices provide respectivepartial-open decrypted values is above the minimum threshold.

In a further implementation of the first, second, and third aspects,further comprising dividing a total number of validator devices into atleast two groups, providing by the beacon device a unique signature-datavalue for each of the at least two groups, wherein the digital signatureof the message is computed only when all of the validator devices ofeach group provide respective partial-open decrypted values computedusing respective unique signature-data values for each of the at leasttwo groups.

In a further implementation of the first, second, and third aspects, themessage for signing thereof is transmitted by a requestor device, in asingle request session over the network to each one of the plurality ofvalidator devices, a respective partial-open decrypted value of thesignature-data value and the message is received by the requestor devicein a single response session from each one of the plurality of validatordevices, and the partial-open decrypted values received from theplurality of validator devices are aggregated by the requestor device tocompute the digital signature of the message.

In a further implementation of the first, second, and third aspects, theDSA process comprises an Elliptic Curve DSA (ECDSA).

In a further implementation of the first, second, and third aspects, theDSA process comprises an Edwards-curve DSA (EdDSA) process.

In a further implementation of the first, second, and third aspects, thesignature-data value includes the following components: (i) an inverseof a random value encrypted with the public key corresponding to theprivate key that is split into the plurality of split-private keyscomputed based on an encryption process that is additive homomorphic andincludes a threshold decryption process, and (ii) an encryption of thefollowing with the public key corresponding to the private key that issplit into the plurality of split-private keys computed based on anencryption process that is additive homomorphic and includes a thresholddecryption process: a product of the inverse of the random value and ahash of a known constant point raised to the power of the random valueand a DSA-private key computed by the beacon device using a DSA process.

In a further implementation of the first, second, and third aspects, thesignature-data value includes the following components: (i) an inverseof a random value split into a plurality of first components using asecret sharing process that is homomorphic to addition, and (ii)splitting the following into a plurality of second components using thesecret sharing process: a product of the inverse of the random value andthe hash of the known constant point raised to the power of the randomvalue and an EdDSA-private key computed by the beacon device usingEdDSA, wherein each of the plurality of validator devices is providedwith a respective first and second component.

In a further implementation of the first, second, and third aspects, thesignature-data value further includes: (iii) the hash of the knownconstant point raised to the power of the random value.

In a further implementation of the first, second, and third aspects, theDSA-private key of the signature-data value is generated using anhd-tree enabling deriving DSA-private keys from a base DSA-private keyusing a derivation index value, and wherein the derivation index valueis provided to the plurality of validator devices for locally computingthe signature-data value.

In a further implementation of the first, second, and third aspects, theDSA-private key comprises an EdDSA-private key, and the hd-enablingderiving DSA-private keys from the base DSA-private key comprisesderiving EdDSA-private keys from the base EdDSA-private key.

In a further implementation of the first, second, and third aspects, theDSA-private key comprises an ECDSA-private key, and the hd-enablingderiving DSA-private keys from the base DSA-private key comprisesderiving ECDSA-private keys from the base ECDSA-private key.

In a further implementation of the first, second, and third aspects, thepublic key and the private key that is split into the plurality ofsplit-private keys are computed based on a threshold decryption process,and further comprising code for: computing a plurality of DSA key pairs,encrypting each private key of the plurality of DSA key pairs to createa plurality of encrypted private keys, providing the plurality ofencrypted private keys to the plurality of validator devices, selectingone of the plurality of encrypted private keys, wherein thesignature-data value does not include the selected private key,providing an indication of the selected encrypted private key to theplurality of validator devices, wherein the partial open decrypted valueis computed using the selected encrypted private key and thesignature-data value which does not include the selected private key.

In a further implementation of the first, second, and third aspects, theDSA process comprises EdDSA, and further comprising code for: computinga plurality of EdDSA key pairs, encrypting each private key of theplurality of EdDSA key pairs to create a plurality of encrypted privatekeys, providing the plurality of encrypted private keys to the pluralityof validator devices, selecting one of the plurality of encryptedprivate keys, wherein the signature-data value does not include theselected private key, providing an indication of the selected encryptedprivate key to the plurality of validator devices, wherein the partialopen decrypted value is computed using the selected encrypted privatekey and the signature-data value which does not include the selectedprivate key.

In a further implementation of the first, second, and third aspects, theDSA process comprises ECDSA, and further comprising code for: computinga plurality of ECDSA key pairs, encrypting each private key of theplurality of ECDSA key pairs to create a plurality of encrypted privatekeys, providing the plurality of encrypted private keys to the pluralityof validator devices, selecting one of the plurality of encryptedprivate keys, wherein the signature-data value does not include theselected private key, providing an indication of the selected encryptedprivate key to the plurality of validator devices, wherein the partialopen decrypted value is computed using the selected encrypted privatekey and the signature-data value which does not include the selectedprivate key.

In a further implementation of the first, second, and third aspects,further comprising: splitting a plurality of encrypted private keys,selecting any one of the split plurality of encrypted private keys,splitting a plurality of signature-data values, selecting any one of thesplit signature-data values, and providing the selected split encryptedkey and the selected split signature-data value to plurality ofvalidator devices using a secret sharing process satisfying the propertyof level-1 homomorphic secret sharing by enabling a multiplicationoperation of encrypted values.

In a further implementation of the first, second, and third aspects, thelevel-1 homomorphic secret sharing comprises level-1 homomorphic sumsecret sharing.

In a further implementation of the first, second, and third aspects, thebeacon device computes and transmits a plurality of instances of thesignature-data value, without triggering by the message.

In a further implementation of the first, second, and third aspects, thebeacon device is connected to the network in a unidirectional mannersuch that traffic is transmitted from the beacon to the network but notin a direction from the network to the beacon.

In a further implementation of the first, second, and third aspects, thebeacon device is implemented as a cold offline wallet that is connectedto a hot wallet implemented as the requestor device.

In a further implementation of the first, second, and third aspects, themessage includes a transaction of cryptocurrency for storage as a recordin a blockchain.

In a further implementation of the first, second, and third aspects, thebeacon repeatedly computes and transmits the signature-value.

In a further implementation of the first, second, and third aspects,after an initialization process, the beacon device computes andtransmits a defined number of instances of different public keys,corresponding private keys, and signature-data values, wherein theplurality of validator devices sign up to the predefined number ofmessages.

Unless otherwise defined, all technical and/or scientific terms usedherein have the same meaning as commonly understood by one of ordinaryskill in the art to which the invention pertains. Although methods andmaterials similar or equivalent to those described herein can be used inthe practice or testing of embodiments of the invention, exemplarymethods and/or materials are described below. In case of conflict, thepatent specification, including definitions, will control. In addition,the materials, methods, and examples are illustrative only and are notintended to be necessarily limiting.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

Some embodiments of the invention are herein described, by way ofexample only, with reference to the accompanying drawings. With specificreference now to the drawings in detail, it is stressed that theparticulars shown are by way of example and for purposes of illustrativediscussion of embodiments of the invention. In this regard, thedescription taken with the drawings makes apparent to those skilled inthe art how embodiments of the invention may be practiced.

In the drawings:

FIG. 1 is a flowchart of a method for digital signing of a message usingsignature-data provided by a beacon device and a single request sessionby a requestor device and a single response session from each ofmultiple validator devices, in accordance with some embodiments of thepresent invention;

FIG. 2 is a block diagram of components of a system for digital signingof a message using signature-data provided by a beacon device and asingle request session by a requestor device and a single responsesession from each of multiple validator devices 208, in accordance withsome embodiments of the present invention;

FIG. 3 is a dataflow diagram of a process for digital signing of amessage using signature-data provided by a beacon device and a singlerequest session by a requestor device and a single response session fromeach of multiple validator devices, in accordance with some embodimentsof the present invention;

FIG. 4 is a flowchart of a method for digital signing of a message usingsignature-data provided by a beacon device, from the perspective of thebeacon device, in accordance with some embodiments of the presentinvention;

FIG. 5 is a flowchart of a method for digital signing of a message usingsignature-data provided by a beacon device, from the perspective of arequestor device, in accordance with some embodiments of the presentinvention; and

FIG. 6 is a flowchart of a method for digital signing of a message usingsignature-data provided by a beacon device, from the perspective of eachvalidator device, in accordance with some embodiments of the presentinvention.

DESCRIPTION OF SPECIFIC EMBODIMENTS OF THE INVENTION

The present invention, in some embodiments thereof, relates to networksecurity and, more specifically, but not exclusively, to systems andmethods for digital signing of a message transmitted over a network.

An aspect of some embodiments of the present invention relates torequestor device, a system, a method, and/or code instructions (i.e.,stored on a data storage device and executable by hardware processor(s))for digital signing of a message. The requestor device transmits, in asingle request session, the message to be signed to each one of multiplevalidator devices. At least a predefined number out of a total number ofvalidator devices, or all validator devices, are required to sign themessage. A beacon device computes and signs a signature-data value, andtransmits the signature-value to each one of the validator devices. Eachof the validator devices computes a respective partial-open decryptedvalue for the signature-data value and the message. The validator devicereceives, in a single response session, the respective partial-opendecrypted value from each one of the validator devices. The requestordevices aggregates the partial-open decrypted values to compute thedigital signature of the message.

An aspect of some embodiments of the present invention relates tovalidator devices, a system, a method, and/or code instructions (i.e.,stored on a data storage device and executable by hardware processor(s))for digital signing of a message. Each one of the validator devices, orat least a minimum number of validator devices of a total number ofvalidator devices, receives a respective copy of a signature-data valuecomputed by a beacon device, and receives the message for signing from arequestor device. The message for signing is received from the requestordevice in a single request session. Each validator device computes arespective partial-open decrypted value of the signature-data value andthe message. Each respective partial-open is transmitted to therequestor device in a single response session. The requestor deviceaggregates the multiple received partial-open decrypted values tocompute the digital signature of the message.

An aspect of some embodiments of the present invention relates to asystem, devices, a method, and/or code instructions (i.e., stored on adata storage device and executable by hardware processor(s)) for digitalsigning of a message. A beacon device computes and signs asignature-data value. The signature-data value is provided to multiplevalidator devices. Each one of the validator devices, or at least aminimum number of validator devices of a total number of validatordevices, receives a respective copy of the signature-data value, andreceives the message for signing from a requestor device. The messagefor signing is received from the requestor device in a single requestsession. Each validator device may verify that the message qualifies forsigning by the respective validator device, for example, satisfying aset of rules. Each validator device computes a respective partial-opendecrypted value of the signature-data value and the message. Eachrespective partial-open is transmitted to the requestor device in asingle response session. The requestor device aggregates the multiplereceived partial-open decrypted values to compute the digital signatureof the message.

The signature-data value may be provided to the multiple validatordevices using an additive homomorphic secret sharing process (e.g., asdescribed with reference tohttps://www(dot)semanticscholar(dot)org/paper/Using-Level-1-Homomorphic-Encryption-to-Improve-DSA-Boneh-Gennaro/a57ae12ec05a71b22ce6504dce29c37c3f86d6fc,the secret sharing process as described hereinbelow, Shamir's SecretSharing, and/or Sum Secret Sharing) and/or using a an encryption schemewith the possibility of a threshold decryption such as a multi-partycomputation (MPC) threshold process, for example, Paillier.

The message may be signed based on a Digital Signature Algorithm (DSA)process, optionally, any variant of Schnorr signatures, for example,Elliptic Curve Digital Signature Algorithm (ECDSA), and/or Edwards-curveDigital Signature Algorithm (EdDSA)).

The beacon may be designed to be secure against malicious attack and/ortampering. Optionally, the beacon is connected to the network in aunidirectional manner such that traffic is transmitted only from thebeacon to the network, but not in a direction from the network to thebeacon. The unidirectional setup may provide an extra layer ofprotection against network based malicious access. The beacon may beimplemented as a cold offline wallet storing cryptocurrency that isconnected to the network in a unidirectional manner, for example, to ahot wallet implemented as the requestor device. The beacon mayrepeatedly compute and transmit the signature-data value, withoutrequiring an external trigger, for example, without being triggered bythe message that is signed using the signature-data value. Alternativelyor additionally, the beacon device transmits data as described hereinafter an initialization process.

At least some implementations of the systems, methods, apparatus, and/orcode instructions described herein improve the technology ofcomputationally efficient digital signing of messages, for example,digital signing of transactions records in a publicly accessiblenetwork, for example, digital signing of cryptocurrency transactions. Atleast some implementations of the systems, methods, apparatus, and/orcode instructions described herein address the technical problem ofcybersecurity, in particular, messages that are digitally signed usingencrypted processes due to the nature of the publicly accessiblenetwork, enabling a malicious entity to attempt to hack and/or accessthe messages, for example, in an attempt to steal the cryptocurrency inthe transaction. The technical problem is in order to prevent maliciousattacks, the encryption processes used to encrypt the message arebecoming increasingly complex, to the point that the computationalstrain put on the network becomes increasingly impractical to implementthe complex secure encryption processes.

Some signing processes are based on MPC, where the device requests thatmultiple other validator devices digitally sign the message together.MPC signing processes require multiple rounds of data transmissions inorder to coordinate the common signing, for example, each validatordevice communicates with all other validator devices. The data forcoordinating the shared signing is problematic in the networkenvironment for multiple reasons, for example, incurring significantdelays due to transmission of the data over multiple rounds, significantprocessing resources of each validator device to process encrypted datamultiple times and/or for processing the transmitted and received data.The network delays and/or processor utilization is especiallyproblematic when the messages are signed in a blockchain environment(e.g., cryptocurrency transactions) since each server hosting a copy ofthe blockchain needs to perform the encryption process as part of theblockchain protocol.

Although attempts have been made to improve the computational efficiencyof MPC processes for digital signing of messages (e.g., in a publicnetwork environment, such as for cryptocurrency transactions recorded ina blockchain) a significant number of coordination rounds are stillrequired. For example, the process described by “Using Level-1Homomorphic Encryption To Improve Threshold DSA Signatures For BitcoinWallet Security”, available for example, athttps://www(dot)semanticscholar(dot)org/paper/Using-Level-1-Homomorphic-Encryption-to-Improve-DSA-Boneh-Gennaro/a57ae12ec05a71b22ce6504dce29c37c3f86d6fcrequires 4 rounds (4n*(n−1) in a logical implementation) to achieve thedigital signing.

Secure digital signing of messages using MPC is resource intensive. Theamount of computation to sign the message requires significantcomputational resources, for example, processor utilization, memory,and/or network bandwidth to transmit messages between the signingentities. One standard solution is able to sign a message using 6communication rounds, or possibly 4 communication rounds, where in eachcommunication round each one of the multiple participating signers sendsa message to all other signers. As such, the total number of messagesthat are transmitted across the network may be represented as about4n*(n−1) messages in a logical implementation where n denotes the numberof participating signers, and further includes a delay of 4 ping time.It is noted that actually the signers assume that they all start whenall the signers want to sign the message. To get to that state, thesigners need to add a further message from each signer to all othersigners (i.e., n−1 messages) and one additional ping time. Moreover,each signing device implements complex and slow computations to performtheir respective signing task, for example, zero knowledge proofs andadditively homomorphic encryption. In contrast, at least some of theimplementations of the systems, methods, apparatus, and/or codeinstructions describe herein, which are based on the signature-datavalue outputted by the beacon device used in the process of signing themessage by the multiple validator devices, reduces the number ofmessages to 2n−2 (exact in some implementations) and two ping times(including letting all validator devices know what to sign) which it isnoted does not include the first ping to see which devices are availableto sign. In some implementations, by cryptography used iscomputationally efficient and/or fast (e.g., when implementing SumSecret Sharing), with no zero knowledge proofs. The computationallyefficient and/or fast cryptography is enabled by the signature-datavalue outputted by the beacon device, as described herein.

At least some implementations of the systems, methods, apparatus, and/orcode instructions described herein provide a beacon device that providesa signature-data value to the validator devices, which reduces thenumber of rounds for signing the message to a single round, including asingle request session where the requestor terminal (that requests thesigning) transmits data to the validator devices, and a single responsesession where the validator devices transmit data back to the requestorterminal. The single round is much more computationally efficient (e.g.,in terms of processor utilization, network latency, network bandwidth)in comparison to other processes that require multiple coordinationrounds.

The signature-data value is provided to multiple validator devices in asingle transmit session, for example, using an additive homomorphicsecret sharing process and/or an additive homomorphic multipartyencryption process, as described herein.

The beacon device may be designed to be tamper proof and/or secure,representing a trusted, uncompromised, authentic source of data. Thebeacon device may be connected to the network in a unidirectionalmanner, such that data may only be transmitted from the beacon deviceover the network, to the validator devices and/or the requestor device.The beacon device may be designed as a passive device that cannot beexternally accessed by other network devices. The beacon device may bedesigned to operate automatically, for example, generating andtransmitting data (e.g., keys, signature-data values) at predefinedintervals (e.g., generated data may be time stamped). The beacon devicemay be implemented as, for example, a cold wallet storing cryptocurrencythat is occasionally connected to the network for short time intervals.

The signature-data value, which is computed by the beacon device, andtherefore represents a trusted, secure, non-comprised data generated bythe beacon device, is validated by the validator devices as having beensigned by the beacon device. The signature-data value may include aDSA-private key computed by the beacon device using a digital signaturealgorithm (DSA) process, optionally Elliptic Curve DSA and/orEdwards-curve DSA, where the private key is encrypted with the publickey (corresponding to the private key that is split into the multiplesplit-private keys) computed based on an encryption process that isadditive homomorphic and includes a threshold decryption process.Alternatively, the signature-data is shared with the validator devicesusing the secret sharing process described herein.

At least some implementations of the systems, methods, apparatus, and/orcode instructions described herein improve the technology of multi-partycomputation (MPC) processes for signing of a message by using thesignature-data values generated by the beacon device for reducing thenumber of transmission and reception sessions to a single transmissionsession followed by a single response session, i.e., a single round. Incontrast, as described herein, other approaches for MPC signing arebased on multiple transmit and multiple reception sessions (sometimesreferred to as “rounds”. The single transmit session and the singlereception session as described herein refer to a single one way exchangeof data involved in the signing of the message. The single session doesnot refer to bi-directional communication required to set-up thecommunication channel for transmission of the data over the singlesession, for example, it is assumed that bidirectional communication isperformed based on one or more protocols such as TCP/IP. The singlesession is in contrast to multiple sessions (i.e., rounds) used bystandard approaches, for example, where in order to sign a message, allthe parties need to send all the other parties another message in 4rounds (in a logical implementation), for example, resulting in 4n*(n−1)rounds where n denotes the number of signing parties.

Before explaining at least one embodiment of the invention in detail, itis to be understood that the invention is not necessarily limited in itsapplication to the details of construction and the arrangement of thecomponents and/or methods set forth in the following description and/orillustrated in the drawings and/or the Examples. The invention iscapable of other embodiments or of being practiced or carried out invarious ways.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

Reference is now made to FIG. 1 , which is a flowchart of a method fordigital signing of a message using signature-data provided by a beacondevice and a single request session by a requestor device and a singleresponse session from each of multiple validator devices, in accordancewith some embodiments of the present invention. FIG. 1 depicts anoverall system level dataflow between multiple devices, including thebeacon device, the requestor device, validator devices, and optionally athird party device. Reference is also made to FIG. 2 , which is a blockdiagram of components of a system 200 for digital signing of a message202 using signature-data provided by a beacon device 204 and a singlerequest session by a requestor device 206 and a single response sessionfrom each of multiple validator devices 208, in accordance with someembodiments of the present invention. Components of system 200 mayimplement the acts of the method described with reference to FIG. 1and/or FIG. 3-6 , by code instructions stored in a memory executed byone or more hardware processors of one or more devices (e.g., beacondevice 204, requestor device 206, multiple validator devices 208).

System 200 includes one or more the following components:

-   -   Beacon device 204 that provides the signature-data value to the        validator devices 206.    -   Requestor device 206 that receives message 202 for signing        thereof, and signs message 202 by coordination with multiple        validator devices 208.    -   Multiple validator devices 208 that together provide a signature        for message 202. It is noted that a single validator device 208        is depicted in FIG. 2 for simplicity and clarity of explanation,        but it is understood that device 208 represents two or more        validator devices. The number of validator devices 208 may be        selected according to a desired security level, where a greater        number of validator devices 208 provide increased security.    -   Third party device 210, which may provide message 202 to        requestor device 206 for signing thereof.    -   Blockchain node(s) 212, each of which stores a copy of the        blockchain that records the signed messages. For example, the        blockchain stores records of signed transactions.    -   Beacon device 204, requestor device 206, validator devices 208,        third party device 210, and blockchain nodes 212, may in        communication with one another over a network 230.

Components of system 200 may be arranged into different architectures,by integrating two or more devices and/or one devices performs featuresof one or more other devices, for example one or a combination of thefollowing:

-   -   Requestor device 206 is one of validator devices 208.        Alternatively, any one of validator devices 208 may act as        requestor 206.    -   Multiple validator devices 208 are blockchain nodes 212.

The communication channels between beacon 204 and/or requestor device206 and/or validator devices 208 (e.g., over network 230) may be secure.Optionally, when beacon 204 sends data (e.g., signature-data) tovalidator devices 208 and/or requestor device 206, the validator devices208 and/or requestor device 206 are the only devices authorized to readthe sent data, and/or validate that the data was sent by beacon 204. Thesecure communication channel may be implemented, optionally over network230, for example, as a direct cable link, and/or using a symmetricalencryption key that is common between beacon 204 and devices 206 and/or208, and/or each of beacon 204 and devices 206 and/or 208 use a publickey. In another example, the secure communication channel is establishedusing a trusted controller, described with reference in U.S. ApplicationNo. 62/775,942, filed Dec. 6, 2018 “SECURE CONSENSUS OVER A LIMITEDCONNECTION”, including at least one shared inventor, incorporated hereinby reference in its entirety.

Each device 204, 206, 208, 210, and/or 212 may be implemented as, forexample, a mobile device, a stationary device, a desktop computer, aserver, a smartphone, a laptop, a tablet computer, a wearable computingdevice, a glasses computing device, a watch computing device, acomputing cloud, a virtual machine, and a virtual server.

It is noted that beacon device 204 may be implemented as a cold storagewallet.

Each device 204, 206, and/or 208 includes a respective processor 214A-Cthat executes respective code 218A-C stored in a respective memory216A-C. Processor(s) 214A-C may be implemented as, for example, centralprocessing unit(s) (CPU), graphics processing unit(s) (GPU), fieldprogrammable gate array(s) (FPGA), digital signal processor(s) (DSP),application specific integrated circuit(s) (ASIC), customizedcircuit(s), processors for interfacing with other units, and/orspecialized hardware accelerators. Processor(s) 214A-C may beimplemented as a single processor, a multi-core processor, and/or acluster of processors arranged for parallel processing (which mayinclude homogenous and/or heterogeneous processor architectures).

Respective memories 216A-C may be implemented as, for example, a harddrive, a random access memory (RAM), read-only memory (ROM), an opticaldrive, an external storage device, and/or other storage devices. It isnoted that processor(s) 214A-C may be designed to implement in hardwareone or more features that would otherwise be stored as code instructionsby respective memories 216A-C.

Beacon device 204 may include a data storage device 220A that storesdata, for example, split-key pair repository 222A that stores thesplit-private keys (generated by splitting the private key) and publickeys that are generated using encryption process that is additivehomomorphic and includes a threshold decryption process, DSA key pairrepository 222B that stores the generated pairs of public and privateDSA keys for signing message 202, and signature-data value repository222C that stores the computed signature-data values. It is noted thatthe split private keys and/or the DSA keys and/or the signature-datavalues may be stored by respective data storage devices of requestordevice 206 and/or validator devices 208 when provided, as describedherein.

Requestor device 206 may include a data storage device 220B that maystore the received message(s) 202 for signing thereof, for example,individually and/or in a message repository.

Validator devices 208 may each include a data storage device 220C thatstores the respective split key, for example, in a split key repository224. It is noted that data storage device 220C may store other data, forexample, the received signature-data value and/or the received message202.

Data storage devices 220A-C may be implemented as, for example, a randomaccess memory (RAM), read-only memory (ROM), non-volatile memory,magnetic media, semiconductor memory devices, hard drive, removablestorage, optical media (e.g., DVD, CD-ROM), a remote storage server, anda computing cloud. It is noted that some data and/or code may be storedin respective data storage devices with executable portions loaded intorespective memories.

Network 230 may be implemented, for example, as one or more of: a wirebased network (e.g., Ethernet), a wireless based network, the internet,a local area network, a wide area network, a virtual private network, avirtual network, a cellular network, a short range wireless network, amesh network, and an ad-hoc network. Network 230 may be implementedusing one or more protocols and/or network architectures.

One or more device 204, 206, and/or 208 may include respective userinterfaces 232A-C that presents data to a user and/or includes amechanism for entry of data, for example, one or more of: atouch-screen, a display, a keyboard, a mouse, voice activated software,and a microphone. Some devices may operate without a user interface, forexample, validator devices 208 may operate without a user interface.

One or more device 204, 206, and/or 208 include a respective networkinterface 234A-C for communicating with network 230, for example,physical and/or virtual components, for example, one or more of,antenna(s), network interface card(s), a wire port, a virtual interfaceimplemented in software, network communication software providing higherlayers of network connectivity, an application programming interface(API), a software development kit (SDK), and/or other implementations.

At 102, a beacon device provides and signs a signature-data value. Thesignature-data value, and optionally an associated timestamp, isprovided to (e.g., transmitted over) multiple validator devices over anetwork.

The signature-data value may be provided to the multiple validatordevices via the requestor device, for example, in an implementation inwhich the beacon is not directly connected to the network but isconnected to the requestor device, for example, where the beacon deviceis implemented as a cold wallet connected to the requestor deviceimplemented as a hot wallet. For example, the requestor device receivesthe signature-data value from the beacon device. The requestor devicemay check that the signature-data value has not been used previously,for example, performing a look up operation in a dataset of previouslyused signature-data values, another example is by checking a sequencenumber that the beacon sends with each signature data. The requestordevice may send the signature-data value to the multiple validatordevices over the network.

The beacon is considered as trusted by the validator devices and/or therequestor device.

The beacon may repeatedly compute and/or generate the signature-value,which may be further signed and/or further provided to the validatordevices. For example, a new signature value is generated periodicallyevery defined time interval (e.g., every microsecond, every second,every minute, every hour, or other time intervals). Alternatively oradditionally, the beacon generates the signature-value during a definedevent, for example, upon initialization (e.g., reset of the beacon,connection of the beacon to a network connected node). Alternatively oradditionally, after an initialization process (e.g., reset of thebeacon, connection of the beacon to a network connected node), thebeacon device computes and provides a defined number of instances ofdifferent signature-data values, and optionally different public keys,and corresponding private keys (when implementing additive homomorphicthreshold encryption). The multiple instances enable the validatordevices to sign a number of messages up to the predefined number ofinstances.

The beacon device is designed to increase security against maliciousattack, in particular, malicious attack originating over the network.Optionally, the beacon device is connected to the network in aunidirectional manner such that traffic is transmitted from the beaconto the network but not in a direction from the network to the beacon.For example, the beacon device is designed as a “dumb” device thatgenerates and transmits the signature-value (and/or other data such askeys) over the network, optionally once a connection is detected. Theunidirectional feature reduces and/or prevents risk of attack over thenetwork. Optionally, the beacon device is implemented as a cold offlinewallet that is optionally connected to the network via a hot walletimplemented, optionally implemented as the requestor device. It is notedthat since the hot wallet is connected to the network, it is prone tomalicious attack, and so cannot be trusted fully. The cold walletimplementation reduces risk of attack, by connecting the cold wallet tothe hot wallet for short time intervals when needed, for example, toperform transactions. The cold wallet is kept offline and disconnectedfrom the network the rest of the time, preventing access via the networkby an attacker. Optionally, the beacon device provides one or moreinstances of the signature-data value (and/or other data such asinstances of different public keys, and corresponding private keys)without being triggered by the message and/or other indication that thesignature-data is required, for example, providing the signature-valueat regular intervals and/or initialization events. The disconnect fromthe message may further reduce risk of malicious activity, for example,by preventing a situation where the message is generated as a maliciousattack. Alternatively, the beacon device may be set to be always alive,generating multiple signature-data values.

The signature-data value may be provided to the validator devices using,for example, an encryption process and/or a secret sharing process. Thesecret sharing process may be additive homomorphic.

The secret sharing process may be implemented, for example, for ECDSAand/or EdDSA.

The secret sharing process described below is used with each pair of acertain signature-data value selected from multiple signature-datavalues and a certain private key selected from multiple private keysused to compute the respective partial-open decrypted values, withoutthe validator devices knowing the pair of the certain signature datavalue and the certain private key that is selected.

The secret sharing process described below is designed to split andshare two secret values between a number of participating devicesdenoted N (e.g., validator devices), where all of the N participatingdevices are required in order to reconstruct the secrets. Using thedescribed secret sharing process, even when N−1 of the N participatingdevices are malicious, the N−1 malicious devices cannot obtain thesecret even when maliciously collaborating with each other.

The secret sharing process described herein satisfies level 1homomorphic secret sharing, which refers to the property that the splitof the secret using the secret sharing process allows for a singlemultiplication operation between the split parts of the secret that isequal to an operation of the whole (i.e., unsplit) secret.

The secret sharing process described herein enables selecting any one ofa first encrypted value and any one of a split second encrypted value(e.g., splitting multiple encrypted private keys and selecting any oneof the split encrypted private keys, and splitting multiplesignature-data values and selecting any one of the split signature-datavalues), and providing the selected split first and second values (e.g.,selected encrypted key and the selected split signature-data value) tomultiple devices (e.g., validator devices) using the secret sharingprocess described herein satisfying the property of level-1 homomorphicsecret sharing (e.g., level-1 homomorphic sum secret sharing) byenabling a multiplication operation of encrypted values.

The secret sharing process described herein may be implemented for acryptographic process (e.g., ECDSA) that requires a multiplicationoperation between two secrets which are required to be kept secret. Wheneach participating device (e.g., validator device) processes itsrespective portion of the secret and distributes the results, thecryptographic process may be applied to the secrets in a manner thateven if N−1 participating devices are malicious, the secrets are notmade available.

The secret sharing process is designed for two values that are keptsecret, k⁻¹ and the private key denoted d. Knowing the value of at leastone of k⁻¹ and the private key d enables controlling the private key. Asecret sharing mechanism process for k⁻¹ and d is now described, suchthat with defined (e.g., agreed) constants denoted r, m, eachparticipating device (e.g., validator device) having the shares for k⁻¹and d may compute a share for k⁻¹(m+r*d) which may be used to generatethe real value of k⁻¹(m+r*d). The secret sharing process hides the realvalue of k⁻¹ and d, which cannot be restored without maliciouscollaboration of all the participating devices.

The secret sharing process enables having multiple different values ofk⁻¹ and multiple different values for d, such that the secret sharingmechanism may work for each pair of sharings of k⁻¹ and d, withoutknowing which pair will be used.

The sum secret sharing scheme is used, such that for the value d theshares uphold:

${\sum\limits_{i}^{n}d_{i}} = d$

The described secret sharing mechanism is homomorphic for addition, butnot for multiplication. The reason is that for secret sharing of k, d:

${\sum\limits_{i}^{n}d_{i}} = d$ ${\sum\limits_{i}^{n}k_{i}} = k$

The following equation holds:

${{\sum\limits_{i}^{n}{d_{i}k_{i}}} \neq {k*d}} = {\sum\limits_{i}^{n}{d_{i}{\sum\limits_{i}^{n}k_{i}}}}$

since:

${\sum\limits_{i}^{n}\left( {d_{i}{\sum\limits_{j \neq i}^{n}k_{j}}} \right)} \neq 0$

The above is a linear equation, which may be used as a requirement forthe secret sharing process. For example, the following may becalculated:

$d_{1} = {\left( {\sum\limits_{i = 2}^{n}\left( {d_{i}{\sum\limits_{j \neq i}^{n}k_{j}}} \right)} \right)/\left( {\sum\limits_{j = 2}^{n}k_{j}} \right)}$

while making sure the following equation holds:

${\sum\limits_{i}^{n}d_{i}} = d$

Which results in the property:

${\sum\limits_{i}^{n}\left( {d_{i}{\sum\limits_{j \neq i}^{n}k_{j}}} \right)} = 0$

Based on the above, the shares may be selected to provide level 1homomorphic encryption. For securing the described secret sharingimplementation, a uniform selection may be performed from the shares(e.g., all the shares) that hold the following properties:

${\sum\limits_{i}^{n}d_{i}} = d$ ${\sum\limits_{i}^{n}k_{i}} = k^{- 1}$${\sum\limits_{i}^{n}\left( {d_{i}{\sum\limits_{j \neq i}^{n}k_{j}}} \right)} = 0$

The described secret sharing implementation is secure against t−1curious participants. For a certain selected private key d for secretsharing thereof, there may be multiple k⁻¹ sharings, and for a certainselected k⁻¹ for secret sharing thereof there may be multiple privatekey d sharings. The described secret sharing process below generatesmultiple sharing for any d and multiple sharing for any k⁻¹ which stillholds the level-1 homomorphic secret sharing property with any pair.

A “good sharing” (i.e., level-1 homomorphic secret sharing) propertydenoted R is defined as follows:

${{R\left( {{da},{ka}} \right)}\text{<=>}{\sum\limits_{i}^{m}\left( {d_{i}{\sum\limits_{j \neq i}^{n}k_{j}}} \right)}} = 0$

Where da denotes the sharing of d and ka denotes the sharing of k⁻¹.c*ka denotes multiplying c with each share, and c+ka denotes adding c/nto each share, and ka′+ka denotes the same as vector addition (r=ka′+ka:ri=ka′i+kai).

For any constant denoted c, the following hold:

R(da,ka)→R(da,c*ka)

R(da,ka)→R(c*da,ka)

Therefore, for any constants, denoted c_(1,2):

R(da,ka)→R(c ₁ *da,c ₂ *ka)

Based on the above, it is noted that there may be multiple k⁻¹ sharingsthat works with multiple d sharings. However, the problem is that eachparticipant device (e.g., validator device) will know the linear ratiobetween each of the k⁻¹'s.

It is noted that:

(R(da,ka),R(da,ka′))→R(da,ka+ka′)

(R(da,ka),R(da′,ka))→R(da+da′,ka)

When the following relationships hold (e.g., are selected and/orcomputed):R(da,ka), R(da,ka′), R(da′,ka), R(da′,ka′), sum(ka)≠0, sum(ka′)≠0,sum(da)≠0, sum(da′)≠0 for any constant denotes c1, c2, c3, c4

R(c1*da+c2*da′,c3*ka+c4*ka′)

When the 4 linear equations above are upheld, (size of the field) keysharing options are provided.

The above described key sharing process may be summarized as follows:

-   -   Given: (da,ka), R(da,ka′), R(da′,ka), R(da′,ka′)    -   Given: at least one of a certain k and/or a certain private key        d    -   Generate: c1 at uniformly.    -   Calculate: c2=(k−c1*sum(ka))/(sum(ka′))    -   New key sharing is denoted: c1*ka+c2*ka′

The following is a mathematical proof for the above described secretsharing process:

$\begin{matrix}{k = {\sum\limits_{i}^{n}\left( {{c_{1}*{ka}_{i}} + {c_{2}*{ka}_{i}^{\prime}}} \right)}} \\{= {{c_{1}{\sum\limits_{i}^{n}\left( {ka}_{i} \right)}} + {c_{2}{\sum\limits_{i}^{n}\left( {ka}_{i}^{\prime} \right)}}}} \\{= {{c_{1}*{{sum}({ka})}} + {c_{2}*{{sum}\left( {ka}^{\prime} \right)}}}} \\{= {{c_{1}*{{sum}({ka})}} + {{\left( {k - {c_{1}*{{sum}({ka})}}} \right)/\left( {{sum}\left( {ka}^{\prime} \right)} \right)}*{{sum}\left( {ka}^{\prime} \right)}}}} \\{= {{{c_{1}*{{sum}({ka})}} + k - {c_{1}*{{sum}({ka})}}} = k}}\end{matrix}$

Other examples of secret sharing processes include, for example,implemented according to Shamir's Secret Sharing (e.g., as describedwith reference tohttps://cs(dot)jhu(dot)edu/˜sdoshi/crypto/papers/shamirturing(dot)pdf),and/or Sum Secret Sharing.

The encryption process may be used, for example, when communicationchannels between the beacon and the validator devices are unsecure. Thesecret sharing process may be used, for example, when the communicationchannels between the beacon and the validator devices are secure.

The threshold decryption process may be implemented, for example, basedon a Paillier process. The threshold decryption process, which uses thesplit-keys, enables the validator devices to open the encryptedsignature-data together without sharing the key with each other, forexample, as described with reference tohttps://iacr(dot)org/archive/pkc2003/25670279/25670279(dot)pdf.

In terms of mathematical formalities, the additive homomorphic propertyof the encryption process and/or of the secret sharing process may bedescribed as follows: given two encrypted values denoted E(a) and E(b),both encrypted with the same private key, a binary operation marked as+_(E) is such that E(a)+_(E)E (b)=E(a+b). Another operation marked as*_(E) is such that a*_(E)E(b)=E(a*b)), where a denotes any member of themessage space.

Optionally, when the encryption process is implemented, the beacondevices generates a public key (e.g., multiple instances of differentpublic keys), and a corresponding private key (e.g., a correspondingprivate key for each of the public keys), optionally using the thresholdencryption process, for example, based on Paillier. The private key issplit into multiple split-keys, which are each provided to a differentvalidator device. The public key may be provided to all validatordevices and/or to the requestor device.

Optionally, another key pair is created, for example, based on EdDSAand/or ECDSA.

Different implementations of the signature-data value may be used.

Optionally, when DSA is implemented, the signature-data value includes aDSA-private key. The DSA-private key may be encrypted with the publickey corresponding to the private key that is split into the multiplesplit-private keys.

The number of the split-private keys may correspond (e.g., equal, atleast equal) to the number of validator devices.

Optionally, when the signature-data is based on the encryption process,the signature-data value includes one or more (optionally all) of thefollowing components: (i) an inverse of a random value encrypted withthe public key corresponding to the private key that is split into thesplit-private keys; and (ii) an encryption of the following with thepublic key corresponding to the private key that is split into themultiple split-private keys: a product of the inverse of the randomvalue and a hash of a known constant point raised to the power of therandom value and a DSA-private key computed by the beacon device usingthe DSA process; and (iii) the hash of a known constant point raised tothe power of the random value.

To help understand mathematical notations used below, the following isan exemplary mathematical representation of the final computed signatureof the message (e.g., computed in 112):

When d denotes a certain private key, and m denotes the message, where gdenotes a known constant point, k denotes a random number, and H denotesa hash function (e.g., sha256). H′(p) denotes a specific hash of a pointp which is part of the DSA algorithm (for example, in ECDSA, H′ denotesthe x coordinate of p)

(r,s)=(H′(g ^(k)),k ⁻¹*(H(m)+H′(g ^(k))*d)), which is noted to be thesame as:

(r,s)=(H′(g ^(k)),k ⁻¹ *H(m)+k ⁻¹ *H′(g ^(k))*d)

The following is an exemplary process for generating the signature-databased on the threshold encryption process and/or DSA performed by thebeacon (e.g., ECDSA).

-   -   1. Choose a random value denoted k    -   2. Compute k⁻¹, optionally denoting an inverse of the value k in        the underlying group, for example, k⁻¹ mod a certain value of n,        where n may denote the number of validator devices.    -   3. Encrypt with the public threshold additive homomorphic        encryption (e.g., Paillier) key to generate the value denoted        E(k⁻¹). Alternatively, k⁻¹ is secret shared using an additive        homomorphic secret sharing process (e.g., Shamir Secret Sharing        and/or Sum Secret Sharing).        -   The operation denotes E( ) may refer to encryption with the            threshold additive homomorphic encryption process and/or            secret shared using the additive homomorphic secret sharing            process.    -   4. Compute g^(k), where g denotes a known constant point    -   5. Compute k⁻¹*H′(g^(k))    -   6. Encrypt with the public threshold encryption (e.g., Paillier)        key to generate the value denoted E(k⁻¹*H′(g^(k))*d).        Alternatively, the value is secret shared.    -   7. The signature-data value includes the value mathematically        denoted E(k⁻¹), H′(g^(k)), E(k⁻¹*H′(g^(k))*d). Alternatively,        the signature-data value is mathematically denoted as E(k⁻¹),        E(k⁻¹*H′(g^(k))*d). (In this case, H′(g^(k)) is sent only to the        requestor).

Alternatively, the above process may be implemented using secretsharing. Rather than encrypting the value (e.g., k⁻¹) using thethreshold encryption process to enable dividing the value amongstmultiple validator devices (where after additive homomorphic operationsthe validator devices may decrypt the encrypted value, as describedherein), the value (e.g., k⁻¹) is provided using secret sharing. Thesecret sharing is additive homomorphic, and after operations asdescribed herein, each validator device is able to access the secretvalue.

Optionally, the DSA-private key (e.g., EdDSA and/or ECDSA) is generatedusing an hd-tree. Multiple keys are generated using the hd-tree,optionally without using level one Paillier. The hd-tree enablesderiving ECDSA and/or EdDSA private keys from a base ECDSA and/or EdDSAprivate key and additional data called chaindata. The private key deviceowner may give any other device the ability to derive the matchingpublic key from the base public key by sending the device the chaindata.The hd-tree enables deriving DSA-private keys from a base DSA-privatekey (e.g., deriving EdDSA-private keys from the base EdDSA-private keyand/or deriving ECDSA-private keys from the base ECDSA-private key)using a derivation index value. The derivation index value is providedto the validator devices for locally computing the signature-data value.

In terms of mathematical notation:

-   -   PrivateKey=d    -   PublicKey=gd    -   Generating by the derivation index and the PublicKey a value        denoted i:    -   NewPrivateKey=PrivateKey+i=d+i    -   NewPublicKey=PublicKey*g^(i)=g^(d)*g^(i)=g^(d+i)    -   )

When the keys are generated using the hd-tree, the signature-data valuemay be implemented based on the following mathematical representation:

E(k⁻¹), E(k⁻¹*H′(g^(k))), E(k⁻¹*H′(g^(k))*d), where given a certainvalue of i, the following may be calculated:i*_(E)E(k⁻¹*H′(g^(k)))+_(E)E(k⁻¹*H′(g^(k))*d)=E(k⁻¹*H′(g^(k))*(d+i)).The process described herein is implemented using E(k⁻¹),E(k⁻¹*H′(g^(k))*(d+i)).

It is noted that E(k⁻¹*H′(g^(k))) may be computed byk⁻¹*_(E)E(H′(g^(k))).

Optionally, when the public key and the private key that is split intothe multiple split-private keys are computed based on the thresholddecryption process, the beacon device generates and/or stores multipleinstances of key pairs, for example, acting as a multi-party computation(MPC) wallet with many keys. The multiple keys are generated withoutnecessarily generating a new and different signature-data value for eachprivate key, for example, a single signature-data value is generated fora set of multiple keys. The same (e.g., single) signature-data value isused only once for a selected single key of the set of multiple keys.The following is an exemplary process for implementing the multiple setof keys with same (e.g., single) signature-data value. Multiple DSA(e.g., EdDSA and/or ECDSA) key pairs are generated. Each private key ofthe key pairs is encrypted to create multiple encrypted private keys.The encrypted private keys are provided to the plurality of validatordevices. One of the encrypted private keys is selected, for example, bythe beacon and/or by the requestor device. The signature-data value doesnot include the selected private key. An indication of the selectedencrypted private key is provided to the validator devices. The partialopen decrypted value (e.g., as described with reference to 108) iscomputed by each respective validator device using the selectedencrypted private key and the signature-data value which does notinclude the selected private key.

When the multiple pairs of keys with same signature-data value isimplemented, the threshold encryption process that is used allows onemultiplication, for example, level one additive homomorphic encryption,for example, in the secret sharing process described herein withreference to 102 of FIG. 1 , and/or above as described with reference to

-   -   https://www(dot)semanticscholar(dot)org/paper/Using-Level-1-Homomorphic-Encryption-to-Improve-DSA-Boneh-Gennaro/a57ae12ec05a71b22ce6504dce29c37c3f86d6fc

In terms of mathematical representation, the beacon provides E(d_(i))for each of the private keys of the set of keys. The signature-datavalue may be implemented as E(k⁻¹), H′(g^(k)), E(k⁻¹*H′(g^(k))). Thebeacon and/or requestor device selects one of the keys and provides anindication of the selected key to the validator devices. Each validatordevices computes a respective partial open (e.g., in 108) asH(m)*_(E)E(k⁻¹)+_(E)E(k⁻¹)*H′(g^(k)))*_(E_level_1)E(d_(i)). The secretvalues (e.g., private keys and signature-data value) may be shared usingthe level 1 homomorphic sum secret sharing process, for example, asdescribed herein.

An implementation using EdDSA MPC is now discussed, optionally in thecontext of the beacon device implemented as a GK8 wallet. Theimplementation may be based on GK8 MPC with an underlying EdDSAsignature (e.g., over the Ed25519 elliptic curve). It is noted thatEdDSA signatures are a variant of Schnorr signatures, and other suitableimplementations may be used. EdDSA may be selected over ECDSA, forexample, when ECDSA involves the problem of distribution of inverting agroup element in a distributed manner, which does not exist with Schnorrsignatures such as EdDSA.

The following is a summary explanation of the keys (both private andpublic), as well as the signature and verification process of an EdDSAsignature. The private key of an EdDSA signature scheme is a b-bitstring denoted k, for some security parameter denoted b. The public keyis denotes as A=s·B (it is noted that multiplication by a scalar isdefined by the underlying group), where B denotes a pre-defined point onthe underlying curve, and s=H₀, . . . , b−1(k) for a pre-defined targetcollision-resistant hash function denoted H (e.g., for Ed25519 SHA-512may be implemented). An EdDSA signature on message denoted M is denotedas the pair (R, S) such that:

R=r·B, where r=H(Hb, . . . 2b−1∥M).

S=r+H(R∥A∥M)·s mod L, where L denotes the order of the underlying group.

Verification of an EdDSA signature is performed by checking if thefollowing equation holds: S·B=R+H(R∥A∥M)·A

It is noted that in the actual implementation M denotes a hashed versionof the original message m. Further details of EdDSA are found, forexample, in RFC 8032.

It is noted that the implementation described herein, based on thebeacon device, validator devices, and requestor device where any one ofthe validator devices may act as the request device may be uneven, asone device may ask for signatures on any message (as opposed to standardapproaches where the message to be signed is assumed known by allparties). This is handled outside of the MPC, so it may be assumed thatthe co-signers (i.e., validator devices) may verify that requests forparticipation in the threshold signature are legal. To achieve athreshold signature, an additively-homomorphic scheme which admitsthreshold decryption which involves one stage of partial decryption, andone stage of combining all of the partially-decrypted shares to form adecryption, is implemented. For example, a secret-sharing scheme (e.g.,Shamir secret sharing) and/or an additively-homomorphic encryptionscheme (e.g., Paillier) and/or any primitive that fits and is secure.The encryption/cipher of this scheme is denoted as E, where theadditively homomorphic action is denoted by +_(E) and the multiplicationof some element denoted g by a scalar denoted e is denoted by g^(e).

The implementation of EdDSA MPC is now briefly discussed. It is notedthat r is defined as a deterministic value given the message and privatekey. r may be completely random for performing a threshold signature. Asimplemented here, r may be random rather than being shared on-the-fly,which is technically difficult or impossible since it depends on themessage. In some implementations, the requestor acts as one of thevalidator devices required to co-sign. The message to be signed isdenoted as m with M denoting the hashed message. The beacon devicesamples a private key denoted k, computes s as above, and shares thevalue using the underlying additive homomorphic scheme. Let si denotethe share of validator device denoted i. It is noted that when anadditively-homomorphic encryption scheme is used then the sharing is ofthe decryption key, and all validator devices receive E(s). The beacondevice may broadcast the public key denoted A. The beacon device maycontinuously sample r's randomly, and shares (i, E(r),R) [i.e.,signature-data], where R is as computed as above, and i is a uniqueindex. The requestor device may provide (e.g., broadcasts) the pair m,i, where i denotes an index of an unused signature data tuple and mdenotes the message to be signed (e.g., as in 106). Upon receiving asignature request each validator device may make sure that the message mis a legal one and that i is an unused signature data tuple (e.g., as in108). Let E(r),R denote the pair indexed by i. Each validator deviceperforms a partial decryption of the following computation (e.g., as in108):

E(S)=E(r)+E(s)^(H(R∥A∥M)) =E(r+H(R∥A∥M)·r)

Each partial-open decryption is provided to the requestor device (e.g.,as in 110). Upon receiving all partial-open decryptions (e.g., therequestor device may computes its own partial-open decryption) therequestor device combines all shares to get S (e.g., as in 112). Therequestor device may publish (R, S) as the signature on m (e.g., as in114).

At 104, a message for signing is received by the requestor device. Themessage may be received, for example, from a third party device, fromthe requestor device itself, and/or from other devices. The message maybe any message for digital signing to increase security of the messages.For example, the message may be a transaction of cryptocurrency betweentwo digital wallets. The transaction record may be stored in theblockchain dataset. In another example, the message may be an entry in adatabase that is signed for extra security.

The requestor device may act as a hot wallet, that may be connected tothe beacon, for example, the beacon implemented as a cold wallet.

At 106, the message for signing is provided by the requestor device tomultiple validator devices. The message for signing is provided in asingle request session over the network.

The message may be transmitted to a number of validator devices requiredfor joint-signing, where all of the validator devices are required tosign the message. Alternatively, the message may transmitted to a numberof validator devices that is greater than a minimum threshold number ofvalidator devices required for joint-signing of the message. The messageis signed when at least the minimum number of validator devices eachsign their respective portion.

Each validator device receives the message for signing in the singlerequest session.

Optionally, the requestor device is one of the validator devices.Alternatively, the requestor device is not one of the validator devices.

The validator devices, which are connected to the network, are trustedby the requestor device (e.g., the hot wallet), but may be vulnerable tomalicious attack over the network. The use of multiple validator devicesto sign the message mitigates the risk of malicious attack.

At 108, each one of the validator devices computes a respectivepartial-open decrypted value of the signature-data value and themessage.

The respective partial-open decrypted value is computed according to theimplementation used to provide the signature data-value, for example,using the respective split-private key applied to the signature-datavalue and the message, and/or using the respective partial-opendecrypted value based on the secret sharing process.

Optionally, prior to the computation of the respective partial-opendecrypted value, each one of the validator devices checks whether themessage qualifies for signing by the respective validator device. Forexample, the message may be evaluated according to a respectiveset-of-rules defining when the respective validator device signs themessage, for example, the value of the cryptocurrency transaction iswithin a range and/or below a maximal value, the originating address ofthe message is valid, the destination address of the message is valid,the originating wallet has sufficient cryptocurrency stored therein toallow the cryptocurrency transaction to another wallet, and the like. Inanother example, the message is presented on a display for viewing by ahuman operator. The human operator may manually approve signing of themessage, or decline signing of the message, for example, by pressing anapprove or decline icon presented on the display.

Optionally, each one of the validator devices validates that the beacondevice signed the signature-data value and/or that the signature-datavalue has not been previously used by the respective validator device.

Each one of the validator devices may perform its own checking and/orvalidation process independently of other validator devices.

When the signature-data is based on the threshold encryption processand/or DSA (e.g., ECDSA), the partial-open decrypted value may becomputed as follows. First, the following is computed using valuesextracted from the signature-data value:H(m)*_(E)E(k⁻¹)+_(E)E(k⁻¹*H′(g^(k))*d)=E(k⁻¹*H(m)+k⁻¹*H′(g^(k))*d)(==H(s)).The partial-open of E(k⁻¹*H(m)+k⁻¹*H′(g^(k))*d) is computed by eachrespective validator device using its own respective split-key, forexample, as described with reference tohttps://people(dot)csail(dot)mit(dot)edu/rivest/voting/papers/DamgardJurikNielsen-AGeneralizationOfPailliersPublicKeySystemWithApplicationsToElectronicVoting(dot)pdf.

Alternatively, the signature-data is provided using secret sharing, asdescribed herein.

At 110, each respective partial-open decrypted value computed by eachrespective validator device is provided to the requestor device in asingle response session.

The requestor device receives in the single response session from eachone of the plurality of validator devices, a respective partial-opendecrypted value computed for the signature-data value and the message.

At 112, the requestor device aggregates the multiple partial-opendecrypted values received from the validator devices to compute thedigital signature of the message.

The requestor device computes an unencrypted signature of the messagefrom the partial open decrypted values.

Optionally, the requestor device validates that the digital signature(computed by aggregating the partial-open decrypted values received fromthe validator devices) is a valid signature of the message, for example,validating that none of the validator devices attempted a maliciousactivity.

Optionally, the requestor device validates that all of the participatingdevices correctly computed the respective partial open. Each respectivepartial-open decrypted value provided by each respective validatordevice may include an indication of proof that the respective validatordevice computed their respective partial open, for example, using zeroknowledge proof and/or the process described below. The indication ofproof may be provided, for example, in a single message and/or asmetadata. For example, using a secret sharing process (e.g., sum secretsharing), each validator device gets its own unique values a_(i), b_(i)(in the ECDSA case for example, (a_(i):=respactive share of k⁻¹*r*d) and(b_(i)=respective share of k{circumflex over ( )}−1)), and returns thevalue b_(i)+(a_(i)*H(m)), where H denotes a hash function as describedherein, and m denotes the message to sign as described herein. a_(i) andb_(i) denote values that may be obtained, for example, from the beacondevice and/or may be predefined values. The beacon device may send thevalues g^(ai) and g^(bi) to the requestor device, where g denotes forexample, a point on the curve when implementing for example, ECDSA, asdescribed herein. When the validator of the digital signature fails, thecertain participating device causing the failure may be detected andexcluded from further message signing. For example, the followingrelationship is validated for each participating device:

g ^(R) =A _(i) ^(H(m)) *B _(i)

-   -   Where    -   R:=Message sent by the i′th validator    -   A_(i)=g^(a) ^(i) sent by the beacon to the requestor    -   B_(i)=g^(b) ^(i) sent by the beacon to the requestor

When the relationship is not met for a certain participating device, thecertain participating device may be designated as malicious and excludedfrom further signing of messages.

Optionally, the digital signature of the message is computed only whenall of the number of the validator devices provide respectivepartial-open decrypted values (i.e., N out of N). It is noted that SumSecret Sharing is compatible with N out of N.

Alternatively, the digital signature of the message is computed when anumber of validator devices above the minimal threshold number ofdevices provide respective partial-open decrypted values (i.e., K out ofN). It is noted that Sum Secret Sharing is not compatible with K out ofN, and so another process (e.g., as described herein) should be used.The technical challenge with implementing K out of N is that if a hackeris able to access less than K (e.g. two) of the validator devices (e.g.,in a 6 out of 10 situation), the hacker may sign a first message and asecond message using the same signature-data value (with the othervalidator devices). Using the same signature-data value twice enablesthe hacker to figure out the private key. In general, for a K out of Nsituation, the hacker may attack a number of validator devices denotedby max(1,2K-N) in order to be able to figure out the private key. Onepossible solution, when K and N are small or when K is close to N (i.e.,when the operation N choose K is small for computational efficiency), isto divide the validator devices into two or more groups. A differentkey, which is split into multiple sub-keys, is created for the differentgroups. Each different key is associated with a different signature-datavalue. Alternatively, different signature-data values are generated forthe different groups, where the requestor device is aware of whichvalidator devices are members of which group. In another solution, whichmay be comprised with the first solution of dividing into groups, is todefined a minimum security level of a number of validator device out ofa total number of validator devices required to provide respectivepartial-open decrypted values for computing of the digital signature ofthe message. The minimum security level is increased to a minimumthreshold according to a set of rules, for example, at least (K+N)/2validator devices. The second solution may be used, for example, whenthe number of K and/or N is large, for example, when K is greater thanhalf of N. When the second solution is combined with the first solutionof dividing into groups, where each group has a number of validatordevices denoted A, the set of rules defining the minimum threshold maybe denoted as (K+A)/2.

In terms of mathematical representation, the unencrypted signature ofthe message is computed using the following equation:

s=k ⁻¹ *H(m)+k ⁻¹ *H′(g ^(k))*d

In terms of mathematical representation, the requestor device validatesthat (r,s)=(H′(g^(k)), k⁻¹*H(m)+k⁻¹*H′(g^(k))*d) is a valid signature ofm.

At 114, the requestor device may provide the computed signature of themessage, for example, published, made publicly accessible, provided tothe requesting third party device, and/or stored in the blockchain.

In terms of mathematical representation, (r,s) is provided.

Reference is now made to FIG. 3 , which is a dataflow diagram of aprocess for digital signing of a message using signature-data providedby a beacon device and a single request session by a requestor deviceand a single response session from each of multiple validator devices,in accordance with some embodiments of the present invention. FIG. 3depicts an overall system level dataflow between multiple devices,including the beacon device, the requestor device, validator devices,and optionally a third party device. One or more features of thedataflow diagram of FIG. 3 may correspond to other features describedherein, for example, as described with reference to FIG. 1 . Thedataflow depicted by FIG. 3 may be implemented by components of system200 described with reference to FIG. 2 .

At 302, a message for signing is received, for example, sent by thirdparty device 210 (and/or another device) to requestor device 206, forexample, as described herein with reference to 104 of FIG. 1 .

At 304, a signature-data value generated by beacon device 204 isprovided to multiple validator devices 208. The signature-data value maybe provided, for example, via an encryption process and/or via a secretsharing process, as described herein, for example, as described hereinwith reference to 102 of FIG. 1 .

It is noted that 302 and 304 may be performed independently of oneanother, and in different order, for example, 304 occurring before 302,302 occurring simultaneously with 304, and/or 302 and 304 occurring atdifferent times without regards to each other.

At 306, the message for signing is provided by requestor device 206 tovalidator devices 208 in a single request session, for example, asdescribed herein with reference to 106 of FIG. 1 .

At 308, each one of the validator devices 208 computes a respectivepartial-open decrypted value of the signature-data value and themessage, for example, as described herein with reference to 108 of FIG.1 .

At 310, the partial-open decrypted values computed by the validatordevices 208 are provided to requestor device 206 in a single responsesession, for example, as described herein with reference to 110 of FIG.1 .

At 312, requestor device 206 aggregates the received partial-opendecrypted values to compute the digital signature of the message, forexample, as described herein with reference to 112 of FIG. 1 .

At 314, requestor device 206 provides the digital signature of themessage, for example, to third party device 210, for example, asdescribed herein with reference to 114 of FIG. 1 .

Reference is now made to FIG. 4 , which is a flowchart of a method fordigital signing of a message using signature-data provided by a beacondevice, from the perspective of the beacon device, in accordance withsome embodiments of the present invention. One or more features of themethod of FIG. 4 may correspond to other features described herein, forexample, as described with reference to FIG. 1 . The process depicted byFIG. 4 may be implemented by components of system 200 described withreference to FIG. 2 .

At 402, the beacon device may be connected to the network. The beacondevice may be offline and connected to a network connected node, forexample, a cold wallet connected to a hot wallet. The beacon device maybe connected to the network by being activated, for example, triggeringan initialization procedure.

At 404, the beacon device generates one or more signature-data values.The signature-data value(s) may be generated periodically, and/ortriggered by the initialization procedure, as described herein.Individual signature-data values may be generated periodically, and/ormultiple signature-data values may be generated together for exampleupon initiation, as described herein.

Other data may be generated, for example, public-private key pairs, asdescribed herein. The private key may be split into multiple split-keys,as described herein.

At 406, the signature-data value are provided to the validator devices,for example, using the encryption process and/or secret sharing process,as described herein.

Other data, for example, the multiple split-keys may be provided to thevalidator devices, as described herein.

Reference is now made to FIG. 5 , which is a flowchart of a method fordigital signing of a message using signature-data provided by a beacondevice, from the perspective of a requestor device, in accordance withsome embodiments of the present invention. One or more features of themethod of FIG. 5 may correspond to other features described herein, forexample, as described with reference to FIG. 1 . The process depicted byFIG. 5 may be implemented by components of system 200 described withreference to FIG. 2 .

At 502, the requestor device receives the message for signing, forexample, from a third party device.

At 504, the requestor device provides the message to multiple validatordevices, in a single request session.

At 506, the requestor device receives multiple partial-open decryptedvalues from the multiple validator devices (i.e., a respectivepartial-open decrypted value from each validator device).

At 508, the requestor device computes the digital signature of themessage from the received partial-open decrypted values. The requestdevice may aggregate the received partial-open decrypted values tocompute the digital signature.

An unencrypted signature of the message may be computed from the partialopen decrypted values.

At 510, the requestor device may validate that the digital signature isa valid signature of the message.

At 512, the digital signature is provided, for example, to theoriginator of the message for signing, such as the third party device.

Reference is now made to FIG. 6 , which is a flowchart of a method fordigital signing of a message using signature-data provided by a beacondevice, from the perspective of each validator device, in accordancewith some embodiments of the present invention. Each validator devicemay perform one or more features of the method of FIG. 6 . One or morefeatures of the method of FIG. 6 may correspond to other featuresdescribed herein, for example, as described with reference to FIG. 1 .The process depicted by FIG. 6 may be implemented by components ofsystem 200 described with reference to FIG. 2 .

At 602, each validator device receives the signature-data valuegenerated by the beacon, for example, via an encryption process and/orvia a secret sharing process.

Other data may be received, for example, a respective split-private keyand/or public key, as described herein.

At 604, each validator device receives the message for signing in asingle request session.

At 606, each respective validator device may perform one or morevalidation processes before signing the message.

Optionally, each respective validator device may check whether themessage qualifies for signing. Each validator device may perform its ownindependent checking, for example, using its own set of rules. It isnoted that for some messages, some validator devices may determine themessage qualifies for signing, and other validator devices may determinethat the message not does qualify for signing.

Alternatively or additionally, each validator device may check that thebeacon device signed the signature-data value and that thesignature-data value has not been previously used.

At 608, each validator device computes a respective partial-opendecrypted value of the signature-data value and the message.

At 610, each validator device provides the respective partial-opendecrypted value to the requestor device in a single response session.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

It is expected that during the life of a patent maturing from thisapplication many relevant message signing will be developed and thescope of the term message signing is intended to include all such newtechnologies a priori.

As used herein the term “about” refers to ±10%.

The terms “comprises”, “comprising”, “includes”, “including”, “having”and their conjugates mean “including but not limited to”. This termencompasses the terms “consisting of” and “consisting essentially of”.

The phrase “consisting essentially of” means that the composition ormethod may include additional ingredients and/or steps, but only if theadditional ingredients and/or steps do not materially alter the basicand novel characteristics of the claimed composition or method.

As used herein, the singular form “a”, “an” and “the” include pluralreferences unless the context clearly dictates otherwise. For example,the term “a compound” or “at least one compound” may include a pluralityof compounds, including mixtures thereof.

The word “exemplary” is used herein to mean “serving as an example,instance or illustration”. Any embodiment described as “exemplary” isnot necessarily to be construed as preferred or advantageous over otherembodiments and/or to exclude the incorporation of features from otherembodiments.

The word “optionally” is used herein to mean “is provided in someembodiments and not provided in other embodiments”. Any particularembodiment of the invention may include a plurality of “optional”features unless such features conflict.

Throughout this application, various embodiments of this invention maybe presented in a range format. It should be understood that thedescription in range format is merely for convenience and brevity andshould not be construed as an inflexible limitation on the scope of theinvention. Accordingly, the description of a range should be consideredto have specifically disclosed all the possible subranges as well asindividual numerical values within that range. For example, descriptionof a range such as from 1 to 6 should be considered to have specificallydisclosed subranges such as from 1 to 3, from 1 to 4, from 1 to 5, from2 to 4, from 2 to 6, from 3 to 6 etc., as well as individual numberswithin that range, for example, 1, 2, 3, 4, 5, and 6. This appliesregardless of the breadth of the range.

Whenever a numerical range is indicated herein, it is meant to includeany cited numeral (fractional or integral) within the indicated range.The phrases “ranging/ranges between” a first indicate number and asecond indicate number and “ranging/ranges from” a first indicate number“to” a second indicate number are used herein interchangeably and aremeant to include the first and second indicated numbers and all thefractional and integral numerals therebetween.

It is appreciated that certain features of the invention, which are, forclarity, described in the context of separate embodiments, may also beprovided in combination in a single embodiment. Conversely, variousfeatures of the invention, which are, for brevity, described in thecontext of a single embodiment, may also be provided separately or inany suitable subcombination or as suitable in any other describedembodiment of the invention. Certain features described in the contextof various embodiments are not to be considered essential features ofthose embodiments, unless the embodiment is inoperative without thoseelements.

Although the invention has been described in conjunction with specificembodiments thereof, it is evident that many alternatives, modificationsand variations will be apparent to those skilled in the art.Accordingly, it is intended to embrace all such alternatives,modifications and variations that fall within the spirit and broad scopeof the appended claims.

It is the intent of the applicant(s) that all publications, patents andpatent applications referred to in this specification are to beincorporated in their entirety by reference into the specification, asif each individual publication, patent or patent application wasspecifically and individually noted when referenced that it is to beincorporated herein by reference. In addition, citation oridentification of any reference in this application shall not beconstrued as an admission that such reference is available as prior artto the present invention. To the extent that section headings are used,they should not be construed as necessarily limiting. In addition, anypriority document(s) of this application is/are hereby incorporatedherein by reference in its/their entirety.

What is claimed is:
 1. A requestor device for digital signing of amessage, comprising: at least one hardware processor executing a codefor: transmitting the message for signing thereof, in a single requestsession over the network to each one of a plurality of validatordevices; wherein a beacon device computes and transmits over a networkto each one of a plurality of validator devices a signature-data valuecomputed and signed by the beacon device, wherein the beacon device isconnected to the network in a unidirectional manner such that traffic istransmitted from the beacon to the network but not in a direction fromthe network to the beacon; receiving in a single response session fromeach one of the plurality of validator devices, a respectivepartial-open decrypted value computed for the signature-data value andthe message; and aggregating the partial-opens decrypted values receivedfrom the plurality of validator devices to compute the digital signatureof the message.
 2. The system of claim 1, wherein the message includes atransaction of cryptocurrency for storage as a record in a blockchain.3. The requestor device of claim 1, further comprising code foridentifying which of the plurality of validator devices is maliciouswhen the digital signature is not validated, by comparing, for eachrespective validator device of the plurality of validator device, afirst value computed using unique values for the respective validatordevice provided by the beacon device and using the message, with asecond value computed using an indication of proof provided by therespective validator device based on the unique values and the message.4. The requestor device of claim 1, further comprising code forvalidating that the digital signature computed by aggregating thepartial-open decrypted values received from the plurality of validatordevices is a valid signature of the message.
 5. A system for digitalsigning of a message, comprising: a plurality of validator devices, eachincluding at least one hardware processor executing a code for:receiving from a beacon device over a network a signature-data valuecomputed and signed by the beacon device, wherein the beacon device isconnected to the network in a unidirectional manner such that traffic istransmitted from the beacon to the network but not in a direction fromthe network to the beacon; receiving the message for signing thereoffrom a requestor device over the network in a single request session;computing a respective partial-open decrypted value of thesignature-data value and the message; and transmitting the respectivepartial-open decrypted value to the requestor device in a singleresponse session, wherein the requestor device aggregates thepartial-open decrypted values received from the plurality of validatordevices to compute the digital signature of the message.
 6. The systemof claim 5, further comprising code for checking whether the messagequalifies for signing by each respective validator device of theplurality of validator devices according to a respective set-of-rules.7. A system for digital signing of a message, comprising: (A) at leastone hardware processor of a beacon device executing a code for:computing and transmitting over a network to each one of a plurality ofvalidator devices: a signature-data value computed and signed by thebeacon device, wherein the beacon device is connected to the network ina unidirectional manner such that traffic is transmitted from the beaconto the network but not in a direction from the network to the beacon;(B) a plurality of validator devices, each including at least onehardware processor executing a code for: receiving the message forsigning thereof from a requestor device over the network in a singlerequest session; computing a respective partial-open decrypted value forthe signature-data value and the message; and transmitting therespective partial-open decrypted value to the requestor device in asingle response session, wherein the requestor device aggregates thepartial-open decrypted values to compute the digital signature of themessage.
 8. The system of claim 7, further comprising code for computingand transmitting over the network to each one of the plurality ofvalidator devices, a public key, and a respective split-private key of aplurality of split-private keys, wherein the signature-data valueincludes a DSA-private key computed by the beacon device using a digitalsignature algorithm (DSA) process, wherein the DSA-private key is atleast one of: encrypted with the public key corresponding to the privatekey that is split into the plurality of split-private keys computedbased on an encryption process that is additive homomorphic and includesa threshold decryption process; and each one of the plurality ofvalidator devices further includes code for computing the respectivepartial-open decrypted value using the respective split-private keyapplied to the signature-data value and the message.
 9. The system ofclaim 7, wherein a signature-data value and a private key are split andshared with each one of the plurality of validator devices using asecret sharing process satisfying the property of level-1 homomorphicsum secret sharing by enabling a multiplication operation of encryptedvalues.
 10. The system of claim 9, wherein the signature-data value thatis split and shared is selected from a plurality of signature-datavalues and the private key that is split and shared is selected from aplurality of private keys used to compute the respective partial-opendecrypted values, without the plurality of validator devices knowing thecertain signature data value and the certain private key that isselected.
 11. The system of claim 7, wherein the signature-data value isshared with each one of the plurality of validator devices using asecret sharing process that is homomorphic to addition; and each one ofthe plurality of validator devices further includes code for computingthe respective partial-open decrypted value based on the secret sharingprocess.
 12. The system of claim 8, wherein a number of the plurality ofsplit-private keys corresponds to a number of validator devices, and thedigital signature of the message is computed only when all of the numberof the plurality of validator devices provide respective partial-opendecrypted values.
 13. The system of claim 8, further comprising defininga minimum security level of a number of validator device out of a totalnumber of validator devices required to provide respective partial-opendecrypted values for computing of the digital signature of the message,increasing the minimum security level to a minimum threshold accordingto a set of rules, wherein a number of the plurality of split-privatekeys corresponds to the total number of validator devices, and thedigital signature of the message is computed when the number of theplurality of validator devices provide respective partial-open decryptedvalues is above the minimum threshold.
 14. The system of claim 8,further comprising dividing a total number of validator devices into atleast two groups, providing by the beacon device a unique signature-datavalue for each of the at least two groups, wherein the digital signatureof the message is computed only when all of the validator devices ofeach group provide respective partial-open decrypted values computedusing respective unique signature-data values for each of the at leasttwo groups.
 15. The system of claim 7, wherein: the message for signingthereof is transmitted by a requestor device, in a single requestsession over the network to each one of the plurality of validatordevices; a respective partial-open decrypted value of the signature-datavalue and the message is received by the requestor device in a singleresponse session from each one of the plurality of validator devices;and the partial-open decrypted values received from the plurality ofvalidator devices are aggregated by the requestor device to compute thedigital signature of the message.
 16. The system of claim 8, wherein thesignature-data value includes one of the following groups of components:A. (i) an inverse of a random value encrypted with the public keycorresponding to the private key that is split into the plurality ofsplit-private keys computed based on an encryption process that isadditive homomorphic and includes a threshold decryption process; and(ii) an encryption of the following with the public key corresponding tothe private key that is split into the plurality of split-private keyscomputed based on an encryption process that is additive homomorphic andincludes a threshold decryption process: a product of the inverse of therandom value and a hash of a known constant point raised to the power ofthe random value and a DSA-private key computed by the beacon deviceusing a DSA process, and B. (i) an inverse of a random value split intoa plurality of first components using a secret sharing process that ishomomorphic to addition; and (ii) splitting the following into aplurality of second components using the secret sharing process: aproduct of the inverse of the random value and the hash of the knownconstant point raised to the power of the random value and anEdDSA-private key computed by the beacon device using EdDSA, whereineach of the plurality of validator devices is provided with a respectivefirst and second component.
 17. The system of claim 7, wherein thebeacon device computes and transmits a plurality of instances of thesignature-data value, without triggering by the message.
 18. The systemof claim 7, wherein the beacon device is implemented as a cold offlinewallet that is connected to a hot wallet implemented as the requestordevice.
 19. The system of claim 7, wherein the beacon repeatedlycomputes and transmits the signature-value.
 20. The system of claim 8,wherein after an initialization process, the beacon device computes andtransmits a defined number of instances of different public keys,corresponding private keys, and signature-data values, wherein theplurality of validator devices sign up to the predefined number ofmessages.